Knapsack Cryptosystem on Elliptic Curves
نویسندگان
چکیده
—The LLL algorithm is strong algorithm that de-crypts the additional type Knapsack cryptosystem. However, the LLL algorithm is not applicable in the addition in the group that rational points of elliptic curves on finite fields do. Therefore, we think the Knapsack cryptosystem constructed on elliptic curves. By using the pairing for the decryption, it is shown to be able to make the computational complexity of the decryption a polynomial time by making the decryption function by the pairing value.
منابع مشابه
Information Security on Elliptic Curves
The aim of this paper is to provide an overview for the research that has been done so far on elliptic curves cryptography role in information security area. The elliptic curves cryptosystem is the newest public-key cryptographic system and represents a mathematically richer procedure then the traditional cryptosystem based on public-key, like RSA, Diffie-Hellman, ElGamal and Digital Signature ...
متن کاملCryptanalysis of two knapsack public-key cryptosystems
In this paper, we cryptanalyze two knapsack cryptosystems. The first one is proposed by Hwang et al [4], which is based on a new permutation algorithm named Permutation Combination Algorithm. We show that this permutation algorithm is useless to the security of the cryptosystem. Because of the special super increasing structure, we can break this cryptosystem use the method provided by Shamir a...
متن کاملPublic-Key Cryptosystem Based on Isogenies
A new general mathematical problem, suitable for publickey cryptosystems, is proposed: morphism computation in a category of Abelian groups. In connection with elliptic curves over finite fields, the problem becomes the following: compute an isogeny (an algebraic homomorphism) between the elliptic curves given. The problem seems to be hard for solving with a quantum computer. ElGamal public-key...
متن کاملUcl Crypto Group Technical Report Series Reducing the Elliptic Curve Cryptosystem of Meyer-m Uller to the Cryptosystem of Rabin-williams Reducing the Elliptic Curve Cryptosystem of Meyer-m Uller to the Cryptosystem of Rabin-williams
At Eurocrypt'96, Meyer and M uller presented a new Rabin-type cryptosystem based on elliptic curves. In this paper, we will show that this cryptosystem may be reduced to the cryptosystem of Williams-Rabin.
متن کاملReducing the elliptic curve cryptosystem of Meyer-Müller to the cryptosystem of Rabin-Williams
At Eurocrypt ’96, Meyer and Müller presented a new Rabin-type cryptosystem based on elliptic curves. In this paper, we will show that this cryptosystem may be reduced to the cryptosystem of Rabin-Williams.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2009 شماره
صفحات -
تاریخ انتشار 2009